A reduction of Semigroup DLP to classic DLP
نویسندگان
چکیده
منابع مشابه
A reduction of Semigroup DLP to classic DLP
We present a polynomial-time reduction of the discrete logarithm problem in any periodic (a.k.a. torsion) semigroup (Semigroup DLP) to the classic DLP in a subgroup of the same semigroup. It follows that Semigroup DLP can be solved in polynomial time by quantum computers, and that Semigroup DLP has subexponential algorithms whenever the classic DLP in the corresponding groups has subexponential...
متن کاملNote a Reduction of Semigroup Dlp to Classic Dlp
We present a polynomial-time reduction of the discrete logarithm problem in any periodic (a.k.a. torsion) semigroup (Semigroup DLP) to the classic DLP in a subgroup of the same semigroup. It follows that Semigroup DLP can be solved in polynomial time by quantum computers, and that Semigroup DLP has subexponential algorithms whenever the classic DLP in the corresponding groups has subexponential...
متن کاملA Reduction from DLP to PDL
We present a reduction from a new logic extending van der Meyden’s dynamic logic of permission (DLP) into propositional dynamic logic (PDL), providing a 2EXPTIME decision procedure and showing that all the machinery for PDL can be reused for reasoning about dynamic policies. As a sideeffect, we establish that DLP is EXPTIME-complete. The logic we introduce extends the logic DLP so that the poli...
متن کاملDlp
DLP (for Description Logic Prover) is a description logic system that contains a sound and complete rea-soner for an expressive description logic. DLP is an experimental system, in that it does not contain all the support facilities that one might like in a full description logic system. However, DLP does have an interface that allows the creation and examination of taxonomies of concepts. DLP ...
متن کاملDLP and FaCT
DLP [Patel-Schneider(1998)] and FaCT [Horrocks(1998)] are two recent description logic systems that contain sound and complete reasoners for expressive description logics. Due to the equivalences between expressive description logics and propositional modal logics, both DLP and FaCT can be used as satisfiability checkers for propositional modal logics. FaCT is a full-featured system that contai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2015
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-015-0130-2